Topologically Ordered Graph Clustering via Deterministic Annealing
نویسندگان
چکیده
This paper proposes an organized generalization of Newman and Girvan’s modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure produces topologically ordered graph partitions that lead to faithful and readable graph representations on a 2 dimensional SOM like planar grid.
منابع مشابه
Optimizing an organized modularity measure for topographic graph clustering: A deterministic annealing approach
This paper proposes an organized generalization of Newman and Girvan’s modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure produces topologically ordered graph clusterings that lead to faithful and readable graph representations based on clustering induced graphs. Topographic graph clustering provides an alternative to more classical solutions i...
متن کاملFuzzy c-Means Clustering, Entropy Maximization, and Deterministic and Simulated Annealing
Many engineering problems can be formulated as optimization problems, and the deterministic annealing (DA) method [20] is known as an effective optimization method for such problems. DA is a deterministic variant of simulated annealing (SA) [1, 10]. The DA characterizes the minimization problem of cost functions as the minimization of Helmholtz free energywhich depends on a (pseudo) temperature...
متن کاملImproved clustering using deterministic annealing with a gradient descent technique
Various techniques exist to solve the non-convex optimization problem of clustering. Recent developments have employed a deterministic annealing approach to solving this problem. In this letter a new approximation clustering algorithm, incorporating a gradient descent technique with deterministic annealing, is described. Results are presented for this new method, and its performance is compared...
متن کاملA Deterministic Annealing Approach to Learning Bayesian Networks
Graphical Models bring together two different mathematical areas: graph theory and probability theory. Recent years have witnessed an increase in the significance of the role played by Graphical Models in solving several machine learning problems. Graphical Models can be either directed or undirected. Undirected Graphical Models are also called Bayesian networks. The manual construction of Baye...
متن کاملLearning with Preknowledge: Clustering with Point and Graph Matching Distance Measures
Prior constraints are imposed upon a learning problem in the form of distance measures. Prototypical 2-D point sets and graphs are learned by clustering with point matching and graph matching distance measures. The point matching distance measure is approx. invariant under affine transformations translation, rotation, scale and shear and permutations. It operates between noisy images with missi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009